Sequential Fourier-Feynman transform, convolution and first variation
نویسندگان
چکیده
منابع مشابه
Sequential Fourier-feynman Transform, Convolution and First Variation
Cameron and Storvick introduced the concept of a sequential Fourier-Feynman transform and established the existence of this transform for functionals in a Banach algebra Ŝ of bounded functionals on classical Wiener space. In this paper we investigate various relationships between the sequential Fourier-Feynman transform and the convolution product for functionals which need not be bounded or co...
متن کاملDiscrete Convolution and the Discrete Fourier Transform
Discrete Convolution First of all we need to introduce what we might call the “wraparound” convention. Because the complex numbers wj = e i 2πj N have the property wj±N = wj, which readily extends to wj+mN = wj for any integer m, and since in the discrete Fourier context we represent all N -dimensional vectors as linear combinations of the Fourier vectors Wk whose components are wkj , we make t...
متن کاملRelationships between Convolution and Correlation for Fourier Transform and Quaternion Fourier Transform
In this paper we introduce convolution theorem for the Fourier transform (FT) of two complex functions. We show that the correlation theorem for the FT can be derived using properties of convolution. We develop this idea to derive the correlation theorem for the quaternion Fourier transform (QFT) of the two quaternion functions.
متن کاملA Conditional Fourier-feynman Transform and Conditional Convolution Product with Change of Scales on a Function Space I
Abstract. Using a simple formula for conditional expectations over an analogue of Wiener space, we calculate a generalized analytic conditional Fourier-Feynman transform and convolution product of generalized cylinder functions which play important roles in Feynman integration theories and quantum mechanics. We then investigate their relationships, that is, the conditional Fourier-Feynman trans...
متن کاملFast Convolution and Fast Fourier Transform under Interval Uncertainty
Convolution y(t) = ∫ a(t − s) · x(s) ds is one of the main techniques in digital signal processing. A straightforward computation of the convolution y(t) requires O(n) steps, where n is the number of observations x(t0), . . . , x(tn−1). It is well known that by using the Fast Fourier Transform (FFT) algorithm, we can compute convolution much faster, with computation time O(n · log(n)). In pract...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2007
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-07-04383-8